On optimistic methods for concurrency control
نویسندگان
چکیده
منابع مشابه
Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing
There is an ever-increasing demand for more complex transactions and higher throughputs in transaction processing systems leading to higher degrees of transaction concurrency and, hence, higher data contention. The conventional two-phase locking (2PL) Concurrency Control (CC) method may, therefore, restrict system throughput to levels inconsistent with the available processing capacity. This is...
متن کاملObservations on optimistic concurrency control schemes
Attstraet-Gptimistic concurrency control schemes allow uncontrolled access to shared data objects during transaction processing under the explicit assumption that read and write coticts among transactions are rare events. Before a transaction commits, the DBMS has to validate that no conflict has occurred Conflict resolution mainly relies on transaction abort. Two different optimistic concurren...
متن کاملTitle : Bounded Locking for Optimistic Concurrency Control
Optimistic methods of concurrency control are gaining popularity. This is especially true with the resurgence of mobile and distributed databases, which inherently rely on optimistic techniques to improve availability and performance of the database system. A key problem with optimistic techniques is that they do not perform well in highly conflict prone environments. Pessimistic techniques, es...
متن کاملOptimistic Concurrency Control for Distributed Unsupervised Learning
Research on distributed machine learning algorithms has focused primarily on one of two extremes—algorithms that obey strict concurrency constraints or algorithms that obey few or no such constraints. We consider an intermediate alternative in which algorithms optimistically assume that conflicts are unlikely and if conflicts do arise a conflict-resolution protocol is invoked. We view this “opt...
متن کاملAnalysis of Optimistic Concurrency Control Revisited
Ryu and Thomasian have analyzed several varieties of optimistic concurrency control under two assumptions: that the characteristics of a transaction remain constant throughout its execution, and that the proportion of committing transactions is xed (in order to avoid an unrealistic biasing of the transaction mixture). We show how both of these assumptions can be relaxed. First, we allow an abor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Database Systems
سال: 1981
ISSN: 0362-5915,1557-4644
DOI: 10.1145/319566.319567